Optimized triangulation algorithm in terrain modeling
نویسندگان
چکیده
منابع مشابه
Delaunay Triangulation Algorithm and Application to Terrain Generation
We describe a randomized incremental algorithm for computing the Delaunay triangulation of a set of points and a recent technique of applying it to terrain generation. The algorithm is optimal, using a Directed Acyclic Graph (DAG)-based location structure for the incremental insertion which achieves an expected running time of O(n log n) and O(n) expected storage. The analysis of the expected s...
متن کاملAdaptive Realtime Terrain Triangulation
A system for realtime terrain triangulation is presented which allows fully user controllable and smooth level of detail transitions. To accomplish this as well as to ooer the possibility of data compression, the terrain elevation data is hierarchically interpolated. The interpolation error, the so called hierarchical surplus, is used as a criterion to detect redundant data and serves as a way ...
متن کاملTerrain-Based Genetic Algorithm (TBGA): Modeling Parameter Space as Terrain
The Terrain-Based Genetic Algorithm (TBGA) is a self-tuning version of the traditional Cellular Genetic Algorithm (CGA). In a TBGA, various combinations of parameter values appear in different physical locations of the population, forming a sort of terrain in which individual solutions evolve. We compare the performance of the TBGA against that of the CGA on a known suite of problems. Our resul...
متن کاملIncremental view-dependent multiresolution triangulation of terrain
A view-dependent multiresolution triangulation algorithm is presented for a real-time flythrough. The triangulation of the terrain is generated incrementally onthe-fly during the rendering time. We show that since the view changes smoothly only a few incremental modifications are required to update the triangulation to a new view. The resulting triangles form a multiresolution Delaunay triangul...
متن کاملA Geometric Compression Algorithm for Massive Terrain Data Using Delaunay Triangulation
In this paper we introduce a new compression technique for a large triangulated terrains using Delaunay triangulation. Our compression technique decomposes a triangulated mesh into two parts. One is a point set whose connecting structure is deened implicitly by Delaunay edges. The other is the set of edges which cannot be recovered by the implicit Delaunay triangulation rule. Thus we only need ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geo-spatial Information Science
سال: 2007
ISSN: 1009-5020,1993-5153
DOI: 10.1007/s11806-007-0016-1